Unfolding and fixpoint semantics of concurrent constraint logic programs

Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs

Unfolding, Procedural and Fixpoint Semantics of Logic Programs

In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs. We introduce 3 main new ideas : the unfolding rule has an associativity property that ensures the adequacy of unfolding semantics with the procedural semantics the uniformly fair computation rules which guarantees strong procedural equi...

The Unfolding Semantics for Constraint Logic Programs

A Fixpoint Semantics for Disjunctive Logic Programs

D We present a fixpoint semantics for disjunctive logic programs. We extend the concept of the Herbrand base of a logic program to consist of all positive clauses that may be formed using the atoms in the Herbrand base. A monotonic closure operator is defined, operating on the lattice formed by the power set of the extended Herbrand base. The closure operator is shown to achieve a least fixpoin...

Oracles and Connuence | a Fixpoint Semantics for Concurrent Constraint Programming

We consider the problem of giving a xpoint semantics for a parallel and non-deterministic programming language with fairness and arbitrary recur-sion, in which both nite and innnite computations are taken into account. We rst deene an operational semantics based on oracles ((nite and inn-nite strings over a countable alphabet), in which the non-deterministic choices are determined by the oracle...